Theories with self-application and computational complexity
نویسندگان
چکیده
منابع مشابه
Theories with self-application and computational complexity
Applicative theories form the basis of Feferman’s systems of explicit mathematics, which have been introduced in the early seventies. In an applicative universe, all individuals may be thought of as operations, which can freely be applied to each other: self-application is meaningful, but not necessarily total. It has turned out that theories with self-application provide a natural setting for ...
متن کاملFinitely unstable theories and computational complexity
The complexity class NP can be logically characterized both through existential second order logic SO∃, as proven by Fagin, and through simulating a Turing machine via the satisfiability problem of propositional logic SAT, as proven by Cook. Both theorems involve encoding a Turing machine by a formula in the corresponding logic and stating that a model of this formula exists if and only if the ...
متن کاملWeak applicative theories , truth , and computational complexity
The aim of our thesis is the design of applicative theories on words of strength below Primitive Recursive Arithmetic to give implicit characterisations of complexity classes in the style of Strahm’s [79]. In more detail, we analyse the effect of adding second-order notions as types or truth to an applicative base theory, and obtain theories of great expressive power, but still polynomial stren...
متن کاملWeak Theories of Arithmetic for Computational Complexity: A Gentle Introduction
In this talk we will discuss about proof-theoretic approaches to computational complexity in terms of weak theories of arithmetic as known as theories of bounded arithmetic, which was initiated by Samuel Buss. We will start with classical facts on primitive recursive functions, and then go into discussion about polynomial time functions and polynomial space functions, including a recent challen...
متن کاملComputational Complexity of Some Quantum Theories in $1+1$ Dimensions
While physical theories attempt to break down the observed structure and behavior of possibly large and complex systems to short descriptive axioms, the perspective of a computer scientist is to start with simple and believable set of rules to discover their large scale behaviors. Computer science and physics, however, can be combined into a new framework, wherein structures can be compared wit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2003
ISSN: 0890-5401
DOI: 10.1016/s0890-5401(03)00086-5